import java.util.HashMap;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User:
 * Date: 2024-10-24
 * Time: 19:28
 */
public class HashBuck2<K,V> {

    static class Node<K,V>{
        public K key;
        public V val;
        public Node<K,V> next;

        public Node(K key, V val){
            this.key = key;
            this.val = val;
        }
    }

    public Node<K,V>[] array = (Node<K,V>[])new Node[10];
    public int useSize;
    public static final double DEFAULT_LOAD_FACTOR = 0.75f;

    public void push(K key, V val){
        int hashcode = key.hashCode();
        int index = hashcode % array.length;

        Node<K,V> cur = array[index];
        while(cur != null){
            if(cur.key.equals(key)){
                cur.val = val;
                return;
            }
            cur = cur.next;
        }

        Node<K,V> node =  new Node<>(key,val);
        node.next = array[index];
        array[index] = node;
        useSize++;
        /*if(doLoadFactor() >= DEFAULT_LOAD_FACTOR){
            //扩容
            resize();
        }*/
    }
    /*public void resize(){
        HashBusk.Node[] newArray = new HashBusk.Node[2*array.length];
        for (int i = 0; i < array.length; i++) {
            Node<K,V> cur = array[i];
            while(cur != null){
                int newIndex = cur.key % newArray.length;
                Node<K,V> curN = cur.next;
                cur.next = newArray[newIndex];
                newArray[newIndex] = cur;
                cur = curN;
            }
        }
        array = newArray;
    }
*/
    public V getVal(K key){
        int hasCode = key.hashCode();
        int index = hasCode % array.length;
        Node<K,V> cur = array[index];
        while(cur != null) {
            if(cur.key.equals(key)){
                return cur.val;
            }
            cur = cur.next;
        }
        return null;
    }

}
